On the high density behavior of Hamming codes with fixed minimum distance
نویسندگان
چکیده
We discuss the high density behavior of a system of hard spheres of diameter d on the hypercubic lattice of dimension n, in the limit n → ∞, d → ∞, d/n = δ. The problem is relevant for coding theory, and the best available bounds state that the maximum density of the system falls in the interval 1 ≤ ρVd ≤ exp(nκ(δ)), being κ(δ) > 0 and Vd the volume of a sphere of radius d. We find a solution of the equations describing the liquid up to an exponentially large value of ρ̃ = ρVd, but we show that this solution gives a negative entropy for the liquid phase for ρ̃ ∼ n. We then conjecture that a phase transition towards a different phase might take place, and we discuss possible scenarios for this transition.
منابع مشابه
On the Hamming-Like Upper Bound on the Minimum Distance of LDPC Codes
In [1] a Hamming-like upper bound on the minimum distance of regular binary LDPC codes is given. In this paper we extend the bound to the case of irregular and generalized LDPC codes over Fq. The bound is shown to lie under the Varshamov–Gilbert bound at high rates.
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملFinding Small Stopping Sets in the Tanner Graphs of LDPC Codes
The performance of low-density parity-check (LDPC) codes over the binary erasure channel for a low erasure probability is limited by small stopping sets. The frame error rate over the additive white Gaussian noise (AWGN) channel for a high signal-to-noise ratio is limited by small trapping sets and by the minimum distance of the LDPC code, which is equal to the codeword with the minimal Hamming...
متن کاملProperties of codes in rank metric
We study properties of rank metric and codes in rank metric over finite fields. We show that perfect codes do not exist. We derive an equivalent of the Varshamov-Gilbert bound in Hamming metric. We study the asymptotic behavior of the minimum rank distance of codes that are on GV. We show that the packing density of maximum rank distance codes is lower bounded by a function depending on the err...
متن کاملA RM-Polar Codes
Introduction: Polar codes are a major breakthrough in coding theory [1]. They can achieve Shannon capacity with a simple encoder and a simple successive cancellation (SC) decoder, both with low complexity of the order of ( ) N N log O , where N is the code block size. But for short and moderate lengths, the error rate performance of polar codes with the SC decoding is not as good as LDPC or tur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cond-mat/0602661 شماره
صفحات -
تاریخ انتشار 2006